Practical bandwidth selection in deconvolution kernel density estimation
نویسندگان
چکیده
Kernel estimation of a density based on contaminated data is considered and the important issue of how to choose the bandwidth parameter in practice is discussed. Some plug-in (PI) type of bandwidth selectors, which are based on non-parametric estimation of an approximation of the mean integrated squared error, are proposed. The selectors are a re4nement of the simple normal reference bandwidth selector, which is obtained by parametrically estimating the approximated mean integrated squared error by referring to a normal density. A simulation study compares these PI bandwidth selectors with a bootstrap (BT) and a cross-validated (CV) bandwidth selector. It is concluded that in 4nite samples, an appropriately chosen PI bandwidth selector and the BT bandwidth selector perform comparably and both outperform the CV bandwidth. The use of the various practical bandwidth selectors is illustrated on a real data example. c © 2002 Elsevier B.V. All rights reserved.
منابع مشابه
Local bandwidth selectors for deconvolution kernel density estimation
We consider kernel density estimation when the observations are contaminated by measurement errors. It is well known that the success of kernel estimators depends heavily on the choice of a smoothing parameter called the bandwidth. A number of data-driven bandwidth selectors exist in the literature, but they are all global. Such techniques are appropriate when the density is relatively simple, ...
متن کاملNonparametric confidence bands in deconvolution density estimation
Uniform confidence bands for densities f via nonparametric kernel estimates were first constructed by Bickel and Rosenblatt [Ann. Statist. 1, 1071–1095]. In this paper this is extended to confidence bands in the deconvolution problem g = f ∗ ψ for an ordinary smooth error density ψ. Under certain regularity conditions, we obtain asymptotic uniform confidence bands based on the asymptotic distri...
متن کاملGlobal Behavior of Deconvolution Kernel Estimates
The desire to recover the unknown density when data are contaminated with errors leads to nonparametric deconvolution problems. The difficulty of deconvolution depends on both the smoothness of error distribution and the smoothness of the priori. Under a general class of smoothness constraints, we show that deconvolution kernel density k-l estimates achieve the best attainable global rates of c...
متن کاملFinite sample penalization in adaptive density deconvolution
We consider the problem of estimating the density g of identically distributed variables Xi, from a sample Z1, . . . , Zn where Zi = Xi + σεi, i = 1, . . . , n and σεi is a noise independent of Xi with known density σ fε(./σ). We generalize adaptive estimators, constructed by a model selection procedure, described in Comte et al. (2005). We study numerically their properties in various contexts...
متن کاملOn boosting kernel density methods for multivariate data: density estimation and classification
Statistical learning is emerging as a promising field where a number of algorithms from machine learning are interpreted as statistical methods and vice–versa. Due to good practical performance, boosting is one of the most studied machine learning techniques. We propose algorithms for multivariate density estimation and classification. They are generated by using the traditional kernel techniqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computational Statistics & Data Analysis
دوره 45 شماره
صفحات -
تاریخ انتشار 2004